Trace Complexity of Chaotic Reversible Cellular Automata
نویسندگان
چکیده
Delvenne, Kůrka and Blondel have defined new notions of computational complexity for arbitrary symbolic systems, and shown examples of effective systems that are computationally universal in this sense. The notion is defined in terms of the trace function of the system, and aims to capture its dynamics. We present a Devaney-chaotic reversible cellular automaton that is universal in their sense, answering a question that they explicitly left open. We also discuss some implications and limitations of the construction.
منابع مشابه
A Novel Image Encryption Scheme Using Chaos and Hybrid Cellular Automata
This paper presents a novel image encryption scheme based on cellular automata (CA) and chaotic logistic mapping. The logistic chaotic mapping is used for shuffling the pixels which results in permutation. This permuted image is converted into a binary stream image where each rows of the image are converted into binary streams. Then a hybrid cellular automata (HCA) is used to provide diffusion ...
متن کاملNovel Design of n-bit Controllable Inverter by Quantum-dot Cellular Automata
Application of quantum-dot is a promising technology for implementing digital systems at nano-scale. Quantum-dot Cellular Automata (QCA) is a system with low power consumption and a potentially high density and regularity. Also, QCA supports the new devices with nanotechnology architecture. This technique works </...
متن کاملRepresenting Reversible Cellular Automata with Reversible Block Cellular Automata
Cellular automata are mappings over infinite lattices such that each cell is updated according to the states around it and a unique local function. Block permutations are mappings that generalize a given permutation of blocks (finite arrays of fixed size) to a given partition of the lattice in blocks. We prove that any d-dimensional reversible cellular automaton can be expressed as the composit...
متن کاملClassification of CA Rules Targeting Synthesis of Reversible Cellular Automata
This paper reports classification of CA (cellular automata) rules targeting efficient synthesis of reversible cellular automata. An analytical framework is developed to explore the properties of CA rules for 3-neighborhood 1-dimensional CA. It is found that in two-state 3neighborhood CA, the CA rules fall into 6 groups depending on their potential to form reversible CA. The proposed classificat...
متن کاملDesigning of Testable Reversible QCA Circuits Using a New Reversible MUX 2×1
Recently testing of Quantum-dot Cellular Automata (QCA) Circuits has attracted a lot of attention. In this paper, QCA is investigated for testable implementations of reversible logic. To amplify testability in Reversible QCA circuits, a test method regarding to Built In Self Test technique is developed for detecting all simulated defects. A new Reversible QCA MUX 2×1 desig...
متن کامل